Consecutive zeros in convolutional codewords
نویسندگان
چکیده
منابع مشابه
Bounds on differences of adjacent zeros of Bessel functions and iterative relations between consecutive zeros
Bounds for the distance |cν,s− cν±1,s′ | between adjacent zeros of cylinder functions are given; s and s′ are such that @cν,s′′ ∈ ]cν,s, cν±1,s′ [; cν,k stands for the kth positive zero of the cylinder (Bessel) function Cν(x) = cosαJν(x)− sinαYν(x), α ∈ [0, π[, ν ∈ R. These bounds, together with the application of modified (global) Newton methods based on the monotonic functions fν(x) = x2ν−1Cν...
متن کاملLarge gaps between consecutive zeros of the Riemann zeta-function
Combining the mollifiers, we exhibit other choices of coefficients that improve the results on large gaps between the zeros of the Riemann zeta-function. Precisely, assuming the Generalized Riemann Hypothesis (GRH), we show that there exist infinitely many consecutive gaps greater than 3.0155 times the average spacing.
متن کاملGaps between consecutive zeros of the Riemann zeta-function
An important problem in number theory is to study the distribution of the non-trivial zeros of the Riemann zeta-function which, if one is willing to assume the Riemann Hypothesis, all lie on a vertical line. It is relatively easy to count how many of these zeros lie in a large interval, so the average spacing between consecutive zeros is easy to compute. However, it is a difficult and interesti...
متن کاملA small improvement in the gaps between consecutive zeros of the Riemann zeta-function
Feng and Wu introduced a new general coefficient sequence into Montgomery and Odlyzko’s method for exhibiting irregularity in the gaps between consecutive zeros of ζ (s) assuming the Riemann hypothesis. They used a special case of their sequence to improve upon earlier results on the gaps. In this paper we consider a general sequence related to that of Feng and Wu, and introduce a somewhat less...
متن کاملOf Pseudo - Codewords
An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based algorithms, e.g. message passing algorithms and decoding based on linear programming, crucially depend on the efficient representation of a code in a graphical model. In order to understand the performance of these alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1972
ISSN: 0012-365X
DOI: 10.1016/0012-365x(72)90035-0